Faster Multidimensional Data Queries on Infrastructure Monitoring Systems
نویسندگان
چکیده
The analytics in online performance monitoring systems have often been limited due to the query of large scale multidimensional data. In this paper, we introduce a faster approach using bit-sliced index (BSI). Our study covers grouping and preference top-k queries with BSI, algorithms design, time complexity evaluation, comparison on real-time production system. research work extended BSI cover attributes filtering grouping. We evaluated single attribute, multiple attributes, feature filtering, To compare existing prior arts, made benchmarking bitmap indexing, sequential scan, collection streaming result our experiments data, proposed outperforms arts: 3 times than indexing attribute queries, 10 stream While comparing baseline scan approach, algorithm factor 100 queries. previous research, had space simulation data various distributions, further studied, evaluated, concluded real
منابع مشابه
Redoop Infrastructure for Recurring Big Data Queries
This demonstration presents the Redoop infrastructure, the first fullfledged MapReduce framework with native support for recurring big data queries. Recurring queries, repeatedly being executed for long periods of time over evolving high-volume data, have become a bedrock component in most large-scale data analytic applications. Redoop is a comprehensive extension to Hadoop that pushes the supp...
متن کاملAn Infrastructure for Manipulating Multidimensional Semistructured Data
Multidimensional Semistructured Data MSSD are semistructured data that present di erent facets under di erent contexts i e alternative worlds For the representa tion of MSSD various formalisms have been proposed by the authors both syntactic such as mssd expressions and MXML as well as graphical such as Multidimensional OEM In this paper we present an infrastructure for handling MSSD This infra...
متن کاملFaster range minimum queries
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries, practical performance and construction time also matter. Additionally, there are offline scenarios in which the number of queries, q, is rather sma...
متن کاملMultidimensional Range Queries on Modern Hardware
Range queries over multidimensional data are an important part of database workloads in many applications. Their execution may be accelerated by using multidimensional index structures (MDIS), such as kd-trees or R-trees. As for most index structures, the usefulness of this approach depends on the selectivity of the queries, and common wisdom told that a simple scan beats MDIS for queries acces...
متن کاملRecommending Multidimensional Queries
Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query should be in his current analysis. To better support this process we propose in this paper to apply a Collaborative Work approach that leverages former explorations of the cube to recommend OLAP queries. The system t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Big Data Research
سال: 2022
ISSN: ['2214-580X', '2214-5796']
DOI: https://doi.org/10.1016/j.bdr.2021.100288